On Non-Empty Cross-Intersecting Families
نویسندگان
چکیده
Let 2[n] and ( $$\matrix{{\left[ n \right]} \cr i } $$ ) be the power set collection of all i-subsets {1, 2, …, n}, respectively. We call t (t ≥ 2) families $${{\cal A}_1},{{\cal A}_2}, \ldots ,{{\cal A}_t} \subseteq {2^{\left[ \right]}}$$ cross-intersecting if Ai ∩ Aj ≠ ∅ for any $${A_i} \in {{\cal A}_i}$$ $${A_j} A}_j}$$ with j. show that, k +l, l r 1, c > 0 $${\cal A} \left( {\matrix{{\left[ \right),{\cal B} \right)$$ , A}$$ B}$$ are $$\left( {\matrix{{n - r} {l \right) \le \left| {\cal \right| 1} then $$\left| + c\left| \max \left\{ {\left( {\matrix{n c\left( \right),\left( {k \right)} \right\}.$$ This implies a result Tokushige second author (Theorem 3.1) also yields 2k, non-empty cross-intersecting, $$\sum\limits_{i = 1}^t {\left| {{{\cal A}_i}} k} 1,\,\,t\left( \right\},} which generalizes corresponding Hilton Milner 2. Moreover, extremal attaining two upper bounds above characterized.
منابع مشابه
On cross-intersecting families
Frankl, P., On cross-intersecting families, Discrete Mathematics 108 (1992) 291-295. Let n 3 t z 1 be integers. Let 9, YI be families of subsets of the n-element set X. They are called cross t-intersecting if IF n GI 2 t holds for all F E 9 and G E 3. If 9 = CfI then 9 is called t-intersecting. Let m(n, t) denote the maximum possible cardinality of a r-intersecting family. Our main result says ...
متن کاملUniformly cross intersecting families
Let A and B denote two families of subsets of an n-element set. The pair (A,B) is said to be `-cross-intersecting iff |A∩B| = ` for all A ∈ A and B ∈ B. Denote by P`(n) the maximum value of |A||B| over all such pairs. The best known upper bound on P`(n) is Θ(2), by Frankl and Rödl. For a lower bound, Ahlswede, Cai and Zhang showed, for all n ≥ 2`, a simple construction of an `-cross-intersectin...
متن کاملOn cross t-intersecting families of sets
For all p, t with 0 < p < 0.11 and 1≤ t ≤ 1/(2p), there exists n0 such that for all n,k with n > n0 and k/n = p the following holds: if A and B are k-uniform families on n vertices, and |A∩B| ≥ t holds for all A ∈A and B ∈B, then |A ||B| ≤ (n−t k−t )2 .
متن کاملOn Cross-intersecting Families of Sets
A family A of ‘-element subsets and a family B of k-element subsets of an n-element set are cross-intersecting if every set from A has a nonempty intersection with every set from B. We compare two previously established inequalities each related to the maximization of the product jAjjBj, and give a new and short proof for one of them. We also determine the maximum of jAjx‘ þ jBjxk for arbitrary...
متن کاملOn Cross-Intersecting Families of Set Partitions
Let B(n) denote the collection of all set partitions of [n]. Suppose A1,A2 ⊆ B(n) are cross-intersecting i.e. for all A1 ∈ A1 and A2 ∈ A2, we have A1 ∩A2 6= ∅. It is proved that for sufficiently large n,
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2022
ISSN: ['0209-9683', '1439-6912']
DOI: https://doi.org/10.1007/s00493-021-4839-4